Deletion along trajectories

Deletion along trajectories

Deletion along Trajectories Technical Report 2003-464

We describe a new way to model deletions on formal languages, called deletion along trajectories. We examine its closure properties, and show that it serves as an inverse to shuffle on trajectories, recently introduced by Mateescu et al. This leads to results on the decidability of equations of the form L T X = R, where L;R are regular languages and X is unknown.

Entropy production along nonequilibrium quantum jump trajectories

For classical nonequilibrium systems, the separation of the total entropy production into the adiabatic and nonadiabatic contributions is useful for understanding irreversibility in nonequilibrium thermodynamics. In this paper, we formulate quantum analogues for driven open quantum systems describable by quantum jump trajectories by applying a quantum stochastic thermodynamics. Our main conclus...

Practical NMPC suboptimality estimates along trajectories

In this paper we develop and illustrate methods for estimating the degree of suboptimality of receding horizon schemes with respect to infinite horizon optimal control. The proposed a posteriori and a priori methods yield estimates which are evaluated online along the computed closed–loop trajectories and only use numerical information which is readily available in the scheme.

Aspects of shuffle and deletion on trajectories

Word and language operations on trajectories provide a general framework for the study of properties of sequential insertion and deletion operations. A trajectory gives a syntactical constraint on the scattered insertion (deletion) of a word into(from) another one, with an intuitive geometrical interpretation. Moreover, deletion on trajectories is an inverse of the shuffle on trajectories. Thes...